Uniform Approximation of φ-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
نویسندگان
چکیده
We consider the approximation of the matrix φ-functions that appear in exponential integrators for stiff systems of differential equations. For stiff systems, the field-of-values of the occurring matrices is large and lies somewhere in the left complex half-plane. In order to obtain an efficient method uniformly for all matrices with a field-of-values in the left complex half-plane, we consider the approximation by a rational Krylov subspace method with equidistant poles of order one on the line Re z = γ > 0. We present error bounds that predict a faster convergence rate as for the resolvent Krylov subspace approximation using a single repeated pole at γ > 0. Poles of order one allow moreover for a parallel implementation of the corresponding rational Krylov subspace decomposition. We analyze the convergence of the proposed rational Krylov subspace method and present numerical experiments that illustrate our results.
منابع مشابه
A Krylov Subspace Algorithm for Evaluating the Φ-functions Appearing in Exponential Integrators
We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector representing the initial condition. The matrix function is a linear combination of the matrix exponential and other functions related to the exponential (the so-c...
متن کاملA Moment-Matching Arnoldi Iteration for Linear Combinations of φ Functions
The action of the matrix exponential and related φ functions on vectors plays an important role in the application of exponential integrators to ordinary differential equations. For the efficient evaluation of linear combinations of such actions we consider a new Krylov subspace algorithm. By employing Cauchy’s integral formula an error representation of the numerical approximation is given. Th...
متن کاملConvergence Analysis of an Extended Krylov Subspace Method for the Approximation of Operator Functions in Exponential Integrators
We analyze the convergence of an extended Krylov subspace method for the approximation of operator functions that appear in exponential integrators. For operators, the size of the polynomial part of the extended Krylov subspace is restricted according to the smoothness of the initial data. This restriction for the continuous operator has a significant influence on the approximation of matrix fu...
متن کاملRational Krylov approximation of matrix functions: Numerical methods and optimal pole selection∗
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large-scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift-and-invert Arnoldi met...
متن کاملEPIRK-W and EPIRK-K time discretization methods
Exponential integrators are special time discretization methods where the traditional linear system solves used by implicit schemes are replaced with computing the action of matrix exponential-like functions on a vector. A very general formulation of exponential integrators is offered by the Exponential Propagation Iterative methods of Runge-Kutta type (EPIRK) family of schemes. The use of Jaco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 35 شماره
صفحات -
تاریخ انتشار 2014